翻訳と辞書 |
Benders' decomposition : ウィキペディア英語版 | Benders' decomposition Benders' decomposition (or Benders's decomposition) is a technique in mathematical programming that allows the solution of very large linear programming problems that have a special block structure. This block structure often occurs in applications such as stochastic programming. The technique is named after Jacques F. Benders. As it progresses towards a solution, Benders' decomposition adds new ''constraints'', so the approach is called "''row'' generation". In contrast, Dantzig–Wolfe decomposition uses "''column'' generation". ==See also==
* FortSP solver uses Benders' decomposition for solving stochastic programming problems
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Benders' decomposition」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|